eulerian graphs造句

To make a graph into an Eulerian graph, one starts with the minimum spanning tree.
The term "'Eulerian graph "'has two common meanings in graph theory.
In his original paper, Rosa proved that all eulerian graphs with size caterpillars, and many other infinite families of trees.
An "'Eulerian cycle "', The term " Eulerian graph " is also sometimes used in a weaker sense to denote a graph where every vertex has even degree.
If a countably infinite graph " G " has no odd-degree vertices, then it may be written as a union of disjoint ( finite ) simple cycles if and only if every finite subgraph of " G " can be extended ( by adding more edges and vertices of " G " ) to a finite Eulerian graph.
It's difficult to find eulerian graphs in a sentence. 用eulerian graphs造句挺难的